A08 - Two Dimensional Sum
https://atcoder.jp/contests/tessoku-book/tasks/tessoku_book_h
提出
code: python
h, w = map(int, input().split())
x = list(map(int, input().split())) for _ in range(h)
q = int(input())
abcd = list(map(int, input().split())) for _ in range(q)
print(abcd)
# 横か縦、どちらかを保持していればいい
# 累積和 ? 差分
解答
code: python
h, w = map(int, input().split())
x = list(map(int, input().split())) for _ in range(h)
q = int(input())
abcd = list(map(int, input().split())) for _ in range(q)
z = [0 * (w+1) for _ in range(h+1)]
for i in range(1, h+1):
for j in range(1, w+1):
zij = zij-1 + xi-1j-1
for j in range(1, w+1):
for i in range(1, h+1):
zij = zi-1j + zij
for a, b, c, d in abcd:
print(zcd + za-1b-1 - za-1d - zcb-1)